#include<stdio.h>
#include<math.h>
//This is a better solution
int cnt=0;
int prime[2000];
//global variables for prime numbers storage
int pss(int n){
    int i;
    for(i=2;i<=sqrt(n);i++)
    if(n%i==0)return 0;
    return 1;
}
void forprocess(){
    int i;
    for(i=2;i<=2000;i++)
    {
        if(pss(i)==1)
        {
            cnt++;
            prime[cnt]=i;
        }
    }
    return;
}
//get the prime numbers smaller then 2000
int check(int n){
    int i,i1;
    for(i=1;i<=cnt;i++)
    for(i1=i+1;i1<=cnt;i1++)
    {
        if(prime[i]+prime[i1]==n)return 1;
        if(prime[i]+prime[i1]>n)break;
    }
    return 0;
}
int main(){
    int i;
    forprocess();
    for(i=4;i<=2000;i+=2)
    {
        if(check(i)==0)
        {
            printf("false\n");
            return 0;
        }
    }
    printf("true\n");
    return 0;
}